Estimating saturation flow under weak discipline traffic conditions, case study: Iran
نویسندگان
چکیده
منابع مشابه
Estimating Traffic Conditions At Metropolitan Scale Using Traffic Flow
1 Traffic has become a major problem in metropolitan areas around the world. It is of a great 2 importance to understand the complex interplay of road networks and traffic conditions. We 3 propose a novel framework to estimate traffic conditions at metropolitan scale using GPS traces. 4 Our approach begins with a coarse inference of network travel times by solving a convex 5 optimization progra...
متن کاملEstimating the loss probability under heavy traffic conditions
This paper studies a multiple-server queueing model under the assumptions of renewal arrival processes and limited buffer size. An approximation for the loss probability and the asymptotic behavior are studied under the heavy traffic conditions. We present an asymptotic analysis of the loss probabilitywhen both the arrival rate and number of servers approach infinity. In illustrative examples, ...
متن کاملDynamic Origin - Destination Demand Flow Estimation under Congested Traffic Conditions
This paper presents a single-level nonlinear optimization model to estimate dynamic origindestination (OD) demand. A path flow-based optimization model, which incorporates heterogeneous sources of traffic measurements and does not require explicit dynamic link-path incidences, is developed to minimize (i) the deviation between observed and estimated traffic states and (ii) the deviation between...
متن کاملWeak values under uncertain conditions
We analyze the average of weak values over statistical ensembles of pre and post-selected states. The protocol of weak values, proposed by Aharonov et al. [3], is the result of a weak measurement conditional on the outcome of a subsequent strong (projective) measurement. Weak values can be beyond the range of eigenvalues of the measured observable and, in general, can be complex numbers. We sho...
متن کاملEstimating Undirected Graphs Under Weak Assumptions
We consider the problem of providing nonparametric confidence guarantees for undirected graphs under weak assumptions. In particular, we do not assume sparsity, incoherence or Normality. We allow the dimension D to increase with the sample size n. First, we prove lower bounds that show that if we want accurate inferences with low assumptions then there are limitations on the dimension as a func...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archives of Transport
سال: 2018
ISSN: 0866-9546,2300-8830
DOI: 10.5604/01.3001.0012.2102